Polynomial Pregroup Grammars parse Context Sensitive Languages
نویسنده
چکیده
Pregroup grammars with a possibly infinite number of lexical entries are polynomial if the length of type assignments for sentences is a polynomial in the number of words. Polynomial pregroup grammars are shown to generate the standard mildly context sensitive formal languages as well as some context sensitive natural language fragments of Dutch, SwissGerman or Old Georgian. A polynomial recognition and parsing algorithm handles the various grammars uniformly. It also computes a planar graph for the semantic cross-serial dependencies in the case of natural languages. keywords: type logical grammar, pregroup grammar, proof graph, complement control, cross-serial dependency, mildly context sensitive language, Dutch subordinate clause, Swiss-German subordinate clause, Old Georgian noun phrase, incremental dependency parsing algorithm.
منابع مشابه
Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars
A family of languages is called mildly context-sensitive if – it includes the family of all -free context-free languages; – it contains the languages • {anbncn : n ≥ 1} – multiple agreement, • {ambncmdn : m,n ≥ 1} – crossed dependencies, and • {ww : w ∈ Σ+} – reduplication; – all its languages are semi-linear; and – their membership problem is decidable in polynomial time. In our paper we intro...
متن کاملPregroup Grammars and Context-free Grammars
Pregroup grammars were introduced by Lambek [20] as a new formalism of type-logical grammars. They are weakly equivalent to context-free grammars [8]. The proof in one direction uses the fact that context-free languages are closed under homomorphism and inverse homomorphism. Here we present a direct construction of a context-free grammar and a push-down automaton, equivalent to a given pregroup...
متن کاملPregroup Grammars with Letter Promotions
We study pregroup grammars with letter promotions p ⇒ q. We show that the Letter Promotion Problem for pregroups is solvable in polynomial time, if the size of p is counted as |n| + 1. In Mater and Fix [9], the problem is shown NP-complete, but that proof assumes the binary (or decimal, etc.) representation of n in p, which seems less natural for applications. We reduce the problem to a graph-t...
متن کاملA Pregroup Toolbox for Parsing and Building Grammars of Natural Languages
Pregroup grammars are a mathematical formalism in the spirit of categorial grammars. They are close to logical formalisms like Lambek calculus but have a polynomial parsing algorithm. The paper presents a pregroup toolbox for parsing and building grammars of natural languages, including a parser that uses a tabular approch based on majority partial composition.
متن کاملFully Lexicalized Pregroup Grammars
Pregroup grammars are a context-free grammar formalism introduced as a simplification of Lambek calculus. This formalism is interesting for several reasons: the syntactical properties of words are specified by a set of types like the other type-based grammar formalisms ; as a logical model, compositionality is easy ; a polytime parsing algorithm exists. However, this formalism is not completely...
متن کامل